Semantics and Tableaus for LPS4
نویسنده
چکیده
An axiomatic formulation of a logic called LPS4 appears in [3]. Here that logic is proved sound and complete with respect to the weak semantics of [7]. Also a tableau system for LPS4 is introduced, and also proved sound and complete with respect to the semantics, thus establishing both cut elimination and equivalence with the axiomatic formulation.
منابع مشابه
TR-2004016: Semantics and Tableaus for LPS4
An axiomatic formulation of a logic called LPS4 appears in [3]. Here that logic is proved sound and complete with respect to the weak semantics of [7]. Also a tableau system for LPS4 is introduced, and also proved sound and complete with respect to the semantics, thus establishing both cut elimination and equivalence with the axiomatic formulation.
متن کاملTR-2004011: Logic of Knowledge with Justifications from the Provability Perspective
An issue of a logic of knowledge with justifications has been discussed since the early 1990s. Such a logic along with the usual knowledge operator 2F “F is known” should contain assertions t:F “t is an evidence of F”. In this paper we build two systems of logic of knowledge with justifications: LPS4, which is an extension of the basic epistemic logic S4 by an appropriate calculus of evidences ...
متن کاملTableaus for many-valued modal logic
We continue a series of papers on a family of many-valued modal logics, a family whose Kripke semantics involves many-valued accessibility relations. Earlier papers in the series presented a motivation in terms of a multiple-expert semantics. They also proved completeness of sequent calculus formulations for the logics, formulations using a cut rule in an essential way. In this paper a novel cu...
متن کاملThe discovery of E.W. Beth’s semantics for intuitionistic logic
One of van Benthem’s predecessors, and the first in line of the Dutch logicians, was Evert Willem Beth. During the last decade of his life he worked on a truly constructive semantics for intuitionistic logic, with a corresponding completeness theorem. The result is known as “Beth models”. We try to describe his intents and efforts, but it is not possible to give a clear story line: the data are...
متن کاملTermination for Hybrid Tableaus
This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Braüner [5]. Their paper gives tableau-based decision procedures for basic hybrid logic (with unary modalities) and the basic logic extended with the global modality. All their proof procedures make use of loop-checks to ensure termination. Here we take a closer look at termination for hybr...
متن کامل